Incentive-Compatible Pricing Algorithm for the Knowledge Package Market
نویسندگان
چکیده
منابع مشابه
Incentive-Compatible Pricing Strategies in Noncooperative Networks
The complexity of modern networks calls for decentralized control schemes where each user makes its control decisions independently based on some individual performance objectives. The operating points of such noncooperative networks are the Nash equilibria of the underlying control game. Nash equilibria are generically inefficient and lead to suboptimal network performance. Using routing as a ...
متن کاملAn Efficient Incentive-Compatible Combinatorial Market Mechanism
Service providers lease bandwidth from owners of individual links to form desired routes. Bandwidth is leased in indivisible amounts, say multiples of 100 Mbps. We study the interaction between buyers and sellers of bandwidth. Within a conventional market, we showed in [8] that a competitive equilibrium exists if agents’ utilities are linear in bandwidth (and money) and they truthfully reveal t...
متن کاملOptimal incentive-compatible pricing for M/G/1 queues
This paper extends previous research on congested service facilities to generalized service distributions, a significant extension given the limitations of exponential distributions for networked computer job modeling. Building on the framework first presented in Mendelson and Whang (1990), we present fundamental theorems for non-priority M/G/1 queues, nonpreemptive M/G/1 queues, and preemptive...
متن کاملAn Incentive Compatible, Efficient Market for Air Traffic Flow Management
We present a market-based approach to the Air Traffic Flow Management (ATFM) problem. The goods in our market are delays and buyers are airline companies; the latter pay money to the Federal Aviation Administration (FAA) to buy away the desired amount of delay on a per flight basis. We give a notion of equilibrium for this market and an LP whose every optimal solution gives an equilibrium alloc...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Herald of CEMI
سال: 2018
ISSN: 2658-3887
DOI: 10.33276/s0000113-7-1